Codebook for multiple user multiple input multiple output system and communication device using the codebook

ABSTRACT

Disclosed are a Multiple User Multiple Input Multiple Output (MU-MIMO) codebook design method, and a communication device using the codebook. A MU-MIMO codebook design method includes analyzing beam patterns of candidate vectors included in a predetermined candidate codebook, and eliminating at least one of the candidate vectors based on the beam patterns of the candidate vectors to generate the MU-MIMO codebook for a MU-MIMO system being comprised of the remaining vectors.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit under 35 U.S.C. §119(a) of Chinese Patent Application No. 200710186649.7, filed on Nov. 21, 2007, in the Chinese Intellectual Property Office, and of Korean Patent Application No. 10-2008-00536987, filed on Jun. 9, 2008, in the Korean Intellectual Property Office, the entire disclosures of which are incorporated herein by reference.

TECHNICAL FIELD

The following description relates to a method of designing a codebook and a system using the same, and more particularly, a Multiple-User Multiple-Input Multiple-Output (MU-MIMO) codebook design method and a communication system and device using the same.

BACKGROUND

Currently, many researches are being conducted regarding technologies to provide various types of multimedia services including voice services and to support high quality and high speed data transmission in a wireless communication environment. For example, technologies associated with a Multiple-Input Multiple-Output (MIMO) communication system using multiple channels are in rapid development.

In general, a MIMO communication system utilizes a base station, and may be classified into a Multiple-User (MU) MIMO system comprising a plurality of users and a single base station, and a Single-User (SU) MIMO system comprising a single user and a single base station.

In a MIMO communication system, a base station and terminals may use a codebook. A certain space may be quantized into a plurality of vectors. The plurality of vectors generated by quantizing the particular space may be stored in the base station and the terminals as the codebook.

For example, each of the terminals may select any one matrix or vector from the plurality of matrixes or vectors included in the codebook, based on a channel that is formed between the base station and each of the terminals. The base station may also recognize the selected matrix or vector based on the codebook. The selected matrix or vector may be used for generating a transmission signal.

A number of studies have been made for a codebook used in a SU-MIMO system. However, there is need for a further study of a codebook used in a MU-MIMO system. For example, in a case where a cell of a base station includes a plurality of sectors, there is a need for an optimized codebook for use in a MU-MIMO system.

SUMMARY

According to an aspect, a Multiple-User Multiple-Input Multiple-Output (MU-MIMO) codebook design method comprises analyzing beam patterns of candidate vectors included in a predetermined candidate codebook, and eliminating at least one of the candidate vectors based on the beam patterns of the candidate vectors to generate the MU-MIMO codebook for a MU-MIMO system being comprised of the remaining vectors.

The method may further comprise optimizing the MU-MIMO codebook based on interferences existed between the remaining vectors.

According to another aspect, a method for operating a base station comprises storing a part or all of vectors included in [u₁u₂ u₄ u₅ u₆ u₇ u₈] as a MU-MIMO codebook, and pre-coding at least one data stream using the stored MU-MIMO codebook, wherein

${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{6} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{3\pi}{4}} & {- j} & {\left. ^{j\frac{\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{7} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{5\pi}{4}} & j & {\left. ^{{- j}\frac{\pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$

According to still another aspect, a method for operating a base station comprises storing a part or all of vectors included in [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u ₄ u₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇] as a MU-MIMO codebook, and pre-coding at least one data stream using the stored MU-MIMO codebook, wherein

u₁=[0.5 0.5 0.5 0.5]^(T),

u ₂=[0.5 0.5j−0.5−0.5j]^(T),

u ₄=[0.5−0.5j−0.5 0.5j] ^(T),

u ₅[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T),

u ₆=[0.5−0.1913+0.4619j−0.3536−0.3536j 0.4619−0.1913j] ^(T),

u ₇=[0.5−0.4619−0.1913j 0.3536+0.3536j−0.1913−0.4619j] ^(T),

u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T),

u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T),

u ₁₀=[0.5−0.3536+0.3536j−0.5j 0.3536+0.3536j] ^(T),

u ₁₁=[0.5−0.3536−0.3536j 0.5j 0.3536−0.3536j] ^(T),

u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T),

u ₁₃=[05 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T),

u ₁₄=[0.5−0.4619+0.1913j 0.3536−0.3536j−0.1913+0.4619j] ^(T),

u ₁₅[0.5−0.1913−0.4619j−0.3536+0.3536j 0.4619+0.1913j] ^(T), and

u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).

According to yet another aspect, a method for operating a base station comprises storing a part or all of vectors included in [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄] as a MU-MIMO codebook, and pre-coding at least one data stream using the stored MU-MIMO codebook, wherein

u₁=[0.5 0.5 0.5 0.5]^(T),

u ₂=[0.5 0.5j−0.5−0.5j] ^(T),

u ₄=[0.5−0.5j−0.5 0.5j] ^(T),

u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T),

u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T),

u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T),

u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T),

u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T), and

u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).

According to yet another aspect, a method for operating a terminal comprises storing a part or all of vectors included in [u₁ u₂ u₄ u₅ u₆ u₇ u₈] as a MU-MIMO codebook, and feeding-back, to a base station, information related with at least one vector from among vectors included in the stored MU-MIMO codebook, wherein

${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{6} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{3\pi}{4}} & {- j} & {\left. ^{j\frac{\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{7} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{5\pi}{4}} & j & {\left. ^{{- j}\frac{\pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$

According to yet another aspect, a method for operating a terminal comprises storing a part or all of vectors included in [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄] as a MU-MIMO codebook, and feeding-back, to a base station, information related with at least one vector from among vectors included in the stored MU-MIMO codebook, wherein

${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$

According to yet another aspect, a method for operating a terminal comprises storing a part or all of vectors included in [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇] as a MU-MIMO codebook, and feeding-back, to a base station, information related with at least one vector from among vectors included in the stored MU-MIMO codebook, wherein

u₁[0.5 0.5 0.5 0.5]^(T),

u ₂=[0.5 0.5j−0.5 0.5j] ^(T),

u ₄=[0.5−0.5j−0.5 0.5j] ^(T),

u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T),

u ₇=[0.5−0.4619−0.1913j 0.3536+0.3536j−0.1913−0.4619j] ^(T),

u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T),

u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T),

u ₁₀=[0.5−0.3536+0.3536j−0.5j 0.3536+0.3536j] ^(T),

u ₁₁=[0.5−0.3536−0.3536j 0.5j 0.3536−0.3536j] ^(T),

u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T),

u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T),

u ₁₄=[0.5−0.4619+0.1913j 0.3536−0.3536j−0.1913+0.4619j] ^(T),

u ₁₅=[0.5−0.1913−0.4619j−0.3536+0.3536j 0.4619+0.1913j] ^(T), and

u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).

According to yet another aspect, a method for operating a terminal comprises storing a part or all of vectors included in [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄] as a MI-MIMO codebook, and feeding-back, to a base station, information related with at least one vector from among vectors included in the stored MU-MIMO codebook, wherein

u₁[0.5 0.5 0.5 0.5]^(T),

u ₂=[0.5 0.5j−0.5−0.5j] ^(T),

u ₄=[0.5−0.5j−0.5 0.5j] ^(T),

u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T),

u ₈[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T),

u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536 j] ^(T),

u ₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T),

u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T), and

u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).

Other features will become apparent to those skilled in the art from the following detailed description, which, taken in conjunction with the attached drawings, discloses exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram illustrating a Multiple-Users Multiple-Input Multiple-Output (MU-MIMO) system according to an exemplary embodiment.

FIG. 2 is an operation flowchart illustrating a MU-MIMO codebook design method according to an exemplary embodiment.

FIG. 3 is a diagram illustrating beam patterns of u₁, u₂, u₃, u₄, u₅, u₆, u₇, u₈ included in a codebook defined in 3^(rd) Generation Partnership Project Long Term Evolution (3GPP LTE).

FIG. 4 is a diagram illustrating beam patterns of u₁, u₂, u₃, u₄, u₅, u₆, u₇, u₈, u₉, u₁₀, u₁₁, u₁₂, u₁₃, u_(14,) u₁₅, u₁₆ included in 4-bit Discrete Fourier Transformation (DFT) codebook.

FIG. 5 is an operation flowchart illustrating a method for operating a base station according to an exemplary embodiment.

FIG. 6 is an operation flowchart illustrating a method for operating a terminal according to an exemplary embodiment.

Throughout the drawings and the detailed description, unless otherwise described, the same drawing reference numerals will be understood to refer to the same elements, features, and structures.

DETAILED DESCRIPTION

The following detailed description is provided to assist the reader in gaining a comprehensive understanding of the methods, apparatuses and/or systems described herein. Accordingly, various changes, modifications, and equivalents of the systems, apparatuses and/or methods described herein will be suggested to those of ordinary skill in the art. Also, descriptions of well-known functions and constructions are omitted to increase clarity and conciseness.

FIG. 1 illustrates a Multiple-Users Multiple-Input Multiple-Output (MU-MIMO) system according to an exemplary embodiment.

Referring to FIG. 1, the MU-MIMO system comprises a base station 110, and a plurality of users 120, 130, and 140. A plurality of antennas is installed in the base station 110, and a single antenna or a plurality of antennas may be installed in each of the plurality of users 120, 130, and 140. A channel is formed between the base station 110 and the plurality of users 120, 130, and 140, and the base station 110 and the plurality of users 120, 130, and 140 transmits/receives signals through the formed channel.

The base station 110 may transmit at least one data stream to the plurality of users 120, 130, and 140. The base station 110 may perform beamforming on the data stream according to, for example, a Spatial Division Multiplexing Access (SDMA) scheme. The base station 110 may generate a pre-coding matrix W_(k) using a codebook {u_(i)}_(i=1) ² ^(B) , and also generate transmission signals using the generated pre-coding matrix W_(k).

The base station 110 transmits pilot signals to the plurality of users 120, 130, and 140 through a downlink channel. Here, the pilot signals are signals well-known to the base station 110 and the plurality of users 120, 130, and 140.

Each of the plurality of users 120, 130, and 140 estimates the channel formed between the base station 110 and the plurality of users 120, 130, and 140 using the pilot signals. Also, the plurality of users 120, 130, and 140 selects, as a preferred vector, any one vector of vectors included in a codebook previously stored based on the estimated channel. Here, u_(i) is an i-th vector included in the codebook, and B is a number of feedback bits. Specifically, where the number of feedback bits is B-bits, 2^(B) vectors generated by quantizing a space are stored in the codebook. Each of all users may have an identical number of feedback bits, however, may have the number of feedback bits which is different for each users according to various factors such as different channel environments of the users, Signal to Interference and Noise Ratio (SINR), and the like in a more optimized manner.

Also, each of the plurality of users 120, 130, and 140 may select any one vector of 2^(B) vectors as a preferred vector with a variety of standards.

For example, each of the plurality of users 120, 130, and 140 may select any one vector of 2^(B) vectors as the preferred vector based on an achievable data transmission rate and the SINR. In addition, each of the plurality of users 120, 130, and 140 may determine a preferred transmission rank. Here, the transmission rank denotes a number of data streams. Specifically, vectors corresponding to a number of data streams from among 2^(B) vectors may be selected as the preferred vectors.

Also, each of the users 120, 130, and 140 feeds back information associated with the selected preferred vector to the base station 110. Here, the information associated with the selected preferred vector may be referred to as a Channel Direction Information (CDI).

The base station 110 receives the information associated with the preferred vectors of each of the plurality of users 120, 130, and 140 to determine a pre-coding matrix. In addition, the base station 110 may select a part or all of the plurality of users 120, 130, and 140 using various user selection algorithms such as Semi-orthogonal User Selection (SUS), Greedy User Selection (GUS), and the like.

In this case, a codebook identical to the codebook stored in the plurality of users 120, 130, and 140 may be stored in the base station 110 in advance.

The base station 110 determines a pre-coding matrix from the previously stored codebook using information associated with the preferred vector received from the plurality of users 120, 130, and 140. The base station 110 may determine the pre-coding matrix such that a sum rate is maximized.

Also, the base station 110 performs pre-coding on data streams S₁ and S_(N) using the determined pre-coding matrix to thereby generate the transmission signals. Here, a process for generating the transmission signals by the base station 110 may be referred to as ‘beamforming’.

In 3GPP LTE (3^(rd) Generation Partnership Project Long Term Evolution), a MU-MIMO codebook for the MU-MIMO system may be designed by redesign a codebook (hereinafter, referred to as RANK 1 SU-MIMO codebook) for the SU-MIMO system used where a rank is ‘1’.

The RANK 1 SU-MIMO codebook defined in 3GPP LTE includes 16 numbered vectors where a number of feedback bits is 4. Here, 16 numbered vectors may be grouped into four unitary matrixes M₁, M₂, M₃, and M₄, and the RANK 1 SU-MIMO codebook may be represented by

$\begin{matrix} {{{{M_{1} = \left\lbrack {u_{1}u_{2}u_{3}u_{4}} \right\rbrack},{M_{2} = \left\lbrack {u_{5}u_{6}u_{7}u_{8}} \right\rbrack},{M_{3} = \left\lbrack {u_{9}u_{10}u_{11}u_{12}} \right\rbrack},{and}}{M_{4} = \left\lbrack {u_{13}u_{14}u_{15}u_{16}} \right\rbrack},{wherein},{u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{3} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- 1} & 1 & {\left. {- 1} \right\rbrack^{T},} \end{matrix}}}}{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}{u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}}{u_{6} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{3\pi}{4}} & {- j} & {\left. ^{j\frac{\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}}{u_{7} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{5\pi}{4}} & j & {\left. ^{{- j}\frac{\pi}{4}} \right\rbrack^{T},} \end{matrix}}}{u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T},} \end{matrix}}}{{u_{9} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & {- 1} & \left. {- 1} \right\rbrack^{T} \end{matrix}}},{u_{10} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & 1 & \left. j \right\rbrack^{T} \end{matrix}}},{u_{11} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- 1} & {- 1} & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{12} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & 1 & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{13} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. {- 1} \right\rbrack^{T} \end{matrix}}},{u_{14} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & {- 1} & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{15} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- 1} & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{and}}{u_{16} = {\frac{1}{2}{\begin{matrix} \left\lbrack 1 \right. & {- 1} & {- 1} & \left. {- 1} \right\rbrack^{T} \end{matrix}.}}}} & \left\lbrack {{Equation}\mspace{14mu} 1} \right\rbrack \end{matrix}$

Equation 1 denotes the RANK 1 SU-MIMO codebook defined in 3GPP LTE, and M₁ and M₂ are DRT matrixes. The DFT matrixes may be in a good match with a Line Of Site (LOS) channel.

However, M₃ and M₄ are matrixes that may be unsuitable for the MU-MIMO system. Also, M₁ and M₂ rather than M₃ and M₄ may be suitable for the MU-MIMO system, however, M₁ and M₂ may not be designed considering a case where the base station 110 has a plurality of sectors. Accordingly, where the base station 110 has the plurality of sectors, to apply M₁ and M₂ as they are to the MU-MIMO system may be unsuitable.

This may be because a coverage of each of the plurality of sectors may be reduced in a case where a cell of the base station 110 includes the plurality of sectors. For example, coverage of a single sector may be 120 degrees where the cell includes three sectors, and the coverage may be 60 degrees where the cell includes six sectors. Specifically, where the cell includes the plurality of sectors, to apply M₁ and M₂ as they are to the MU-MIMO system may unnecessarily increase a size of the codebook. Thus, the codebook may be comprised of only vectors required for covering the coverage of the single sector. In this case, by reducing the size of the codebook, a number of feedback bits may be reduced. The codebook for the SU-MIMO system may include the DFT codebook. A 3-bit DFT codebook is comprised of U₁=[u₁ u₂ u₃ u₄] and U₂=[u₅ u₆ u₇ u₈], and a 4-bit DFT codebook is comprised of U₁=[u₁ u₂ u₃ u₄], U₂=[u₅ u₆ u7 u₈], U₃=[u₉ u₁₀ u₁₁ u₁₂], and U₄=[u₁₃ u₁₄ u₁₅ u₁₆].

Here, a b-th matrix U^((b)) of the DFT codebook and a (m+1)-th row vector u_(m) ^((b)) of U_((b)) may be represented by

U^((b))=[u₀ ^((b)) . . . u_(M−1) ^((b))],   [Equation 2].

wherein, M denotes a number of transmission antennas.

Where the number of transmission antennas is 4, 16 numbered vectors included in the 4-bit DFT codebook may be represented by

u₁=[0.5 0.5 0.5]^(T),

u ₂=[0.5 0.5j−0.5−0.5j] ^(T),

u ₃=[0.5−0.5 0.5−0.5]^(T),

u ₄=[0.5−0.5j−0.5 0.5j] ^(T),

u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T),

u ₆=[0.5−0.1913+0.4619j−0.3536−0.3536j 0.4619−0.1913j] ^(T),

u ₇=[0.5−0.4619−0.1913j 0.3536+0.3536j−0.1913−0.4619j] ^(T),

u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T),

u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T),

u ₁₀=[0.5 0.3536+0.3536j−0.5j 0.3536+0.353j] ^(T),

u ₁₁=[0.5 0.3536−0.3536j 0.5j 0.3536−0.3536j] ^(T),

u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T),

u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T),

u ₁₄=[0.5−0.4619+0.1913j 0.3536−0.3536j−0.1913+0.4619j] ^(T),

u ₁₅=[0.5−0.1913−0.4619j−0.3536+0.3536j 0.4619+0.₁₉₁₃ j] ^(T), and

u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).   [Equation 3]

The DFT codebook as described above is designed without considering a case where the base station 110 includes the plurality of sectors, like the RANK 1 SU-MIMO codebook defined in 3GPP LTE.

Like the RANK 1 SU-MIMO codebook, to use the DFT codebook, as is, may unnecessarily increase the size of the codebook where the cell includes the plurality of sectors, which may result in being unsuitable.

In this case, whether an appropriate codebook is newly designed by selecting vectors from among vectors included in the original DFT codebook or the RANK 1 SU-MIMO codebook where the cell includes the plurality of sectors will be herein described.

FIG. 2 illustrates a MU-MIMO codebook design method according to an exemplary embodiment.

FIG. 3 illustrates beam patterns of u₁, u₂, u₃, u₄, u₅, u₆, u₇, u₈ included in a codebook defined in 3GPP LTE, and FIG. 4 illustrates beam patterns of u₁, u₂, u₃, u₄, u₅, u₆, u₇, u₈, u₉, u₁₀, u₁₁, u₁₂, u₁₃, u₁₄, u₁₅, u₁₆ included in 4-bit DFT codebook.

Referring to FIG. 2, the MU-MIMO codebook design method comprises analyzing beam patterns of candidate vectors included in a candidate codebook previously prepared in operation S210.

In this embodiment, the candidate codebook is a codebook for a SU-MIMO system, and the codebook for the SU-MIMO system may include the DFT codebook or a codebook defined in 3GPP LTE.

Referring to FIG. 3, each of eight vectors included in the codebook defined in 3GPP LTE has unique beam patterns. In particular, u₃ from among eight vectors has the widest lobe.

In a case where a cell of the base station is comprised of three sectors, a coverage of a single cell is 120 degrees. In this case, a coverage of 120 degrees ranging from 60 to −60 degrees may be seen to be well-covered using the remaining seven vectors obtained by eliminating u₃ from among eight vectors. Also, a coverage of each of three sectors may be seen to be well-covered using the remaining seven vectors in an identical manner.

Also, in a case where the cell of the base station is comprised of six sectors, a coverage of a single cell is 60 degrees. In this case, a coverage of 60 degrees ranging from 30 to −30 degrees may be seen to be well-covered using u₂, u₅, u₁, u₈ or u₅, u₁, u₈, u₄.

Referring to FIG. 4, the 4-bit DFT codebook is comprised of sixteen vectors. In a case where the cell of the base station is comprised of three sectors, a coverage of a single cell is 120 degrees, and a coverage of 120 degrees ranging from 60 to −60 degrees may be seen to be well-covered using [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇].

Consequently, where the cell of the base station includes the plurality of sectors, the coverage of the single sector may be well-covered even without using eight vectors included in the codebook defined in 3GPP LTE or sixteen vectors included in the 4-bit DFT codebook. As a result, a size of the codebook may be reduced, and the number of feedback bits may be reduced along with a reduction in the size of the codebook.

Referring back to FIG. 2, the MU-MIMO codebook design method further comprises eliminating at least one vector of the candidate vectors based on the beam patterns of the candidate vectors in operation S220. Here, the operation S220 for eliminating at least one vector may be an operation for eliminating at least one vector of the candidate vectors based on a coverage of each of the plurality of sectors.

The MU-MIMO codebook design method further comprises eliminating at least one vector of the candidate vectors according to the beam patterns of the candidate vectors, and generating a MU-MIMO codebook for the MU-MIMO system being comprised of the remaining vectors obtained by eliminating the at least one vector, in operation S230.

In a case of the cell comprised of the plurality of sectors, the operation S230 for generating the MU-MIMO codebook may be an operation for eliminating at least one vector of the candidate vectors according to a coverage corresponding to each of the plurality of sectors to thereby generate the MU-MIMO codebook being comprised of the remaining vectors. Here, a coverage of each of the plurality of sectors may be well-covered using the MU-MIMO codebook being identical for each of the plurality of sectors.

In the case of the cell comprised of the plurality of sectors, the operation S230 for generating the MU-MIMO codebook may be an operation for generating the MU-MIMO codebook in order to well-cover a single sector by the remaining vectors.

Also, the operation S230 for generating the MU-MIMO codebook may be an operation for eliminating at least one vector of the candidate vectors in the order from a largest beam width of the candidate vectors to thereby generate the MU-MIMO codebook being comprised of the remaining vectors.

As an example, the operation S230 may generate the MU-MIMO codebook as [u2 u₅ u₁ u₈] or [u₅ u₁ u₈ u₄] where the cell is comprised of three sectors and the previously prepared candidate codebook is the codebook for SU-MIMO system defined in 3GPP LTE.

Here,

${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$

As another example, the operation S230 for generating the MU-MIMO codebook may generate the MU-MIMO codebook as [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄] where the cell is comprised of six sectors and the previously prepared candidate codebook is the codebook for MU-MIMO system defined in 3GPP LTE.

Here,

${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$

As another example, the operation S230 for generating the MU-MIMO codebook may generate the MU-MIMO codebook as [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇] where the cell is comprised of three sectors and the previously prepared candidate codebook is the 4-bit DFT codebook. Here,

u₁=[0.5 0.5 0.5 0.5]^(T),

u ₂=[0.5 0.5j−0.5−0.5j] ^(T),

u ₄=[0.5−0.5j−0.5 0.5j] ^(T),

u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T),

u ₆=[0.5−0.1913+0.4619j−0.3536−0.3536j 0.4619−0.1913j] ^(T),

u ₇=[0.5−0.4619−0.1913j 0.3536+0.3536j−0.1913−0.4619j] ^(T),

u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T),

u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T),

u ₁₀=[0.5−0.3536+0.3536j−0.5j 0.3536+0.3536j] ^(T),

u ₁₁=[0.5−0.3536−0.3536j 0.5j 0.3536−0.3536j] ^(T),

u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.353j] ^(T),

u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T),

u ₁₄=[0.5−0.4619+0.1913j 0.3536−0.3536j−0.1913+0.4619j] ^(T),

u ₁₅=[0.5−0.1913−0.4619j−0.3536+0.3536j 0.4619+0.1913j] ^(T), and

u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).

As another example, the operation S230 for generating the MU-MIMO codebook may generate the MU-MIMO codebook as [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄] where the cell is comprised of six sectors and the previously prepared candidate codebook is the 4-bit DFT codebook.

Here,

u₁=[0.5 0.5 0.5 0.5]^(T),

u ₂=[0.5 0.5j−0.5−0.5j] ^(T),

u ₄=[0.5−0.5j−0.5 0.5j] ^(T),

u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T),

u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T),

u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T),

u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T),

u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T) , and

u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).

Accordingly, the MU-MIMO codebook design method according to an exemplary embodiment may appropriately select vectors based on a number of sectors included in the cell and a coverage of each of the sectors, thereby minimizing a size of the codebook while well-covering the coverage of each of the sectors.

Referring back to FIG. 2, the MU-MIMO codebook design method further comprises optimizing the MU-MIMO codebook based on interferences generated between the remaining vectors in operation S240.

The operation S240 for optimizing the MU-MIMO codebook may be an operation for selecting a part or all of the remaining vectors depending on a predetermined number of feedback bits based on the interference generated between the remaining vectors. In addition, the operation S240 for optimizing the MU-MIMO codebook may be an operation for calculating SINR of the remaining vectors based on the interferences generated between the remaining vectors, and selecting a part or all of the remaining vectors based on the SINR of the remaining vectors.

A size of the MU-MIMO codebook, that is, a number of vectors included in the MU-MIMO codebook may be determined depending on a number of feedback bits. For example, where the number of feedback bits is 3, the number of vectors included in the MU-MIMO codebook may be limited to 8 or less, and where the number of feedback bits is 4, the number of vectors included in the MU-MIMO codebook may be limited to 16 or less.

Accordingly, the MU-MIMO codebook generated through the operation S230 for generating the MU-MIMO codebook may be adjusted or optimized in size depending on the number of feedback bits. In this case, the MU-MIMO codebook is comprised of the remaining vectors obtained by eliminating at least one vector of the candidate vectors.

A metric used for optimizing the MU-MIMO codebook may be determined based on a Signal to Interference Ratio (SIR). In particular, SIR_(i, j), that is, an SIR of an i-th beam with respect to a j-th beam may be represented by

$\begin{matrix} {{{{SIR}_{i,j} = {\min\limits_{\theta \in \alpha_{i}}{\frac{A_{i}(\theta)}{A_{j}(\theta)}}^{2}}},{{A_{i}(\theta)} = {{{{space}(\theta)}u_{i}^{H}}}},{and}}{{{{space}(\theta)} = \begin{bmatrix} {1,^{{- j}\frac{2\pi}{\lambda}d\; \sin \; \theta},\ldots \mspace{14mu},} \\ {^{{- j}\frac{2\pi}{\lambda}{({n - 1})}d\; \sin \; \theta}\mspace{11mu} \ldots \mspace{14mu} ^{{- j}\frac{2\pi}{\lambda}{({N - 1})}d\; \sin \; \theta}} \end{bmatrix}},{wherein}}} & \left\lbrack {{Equation}\mspace{14mu} 4} \right\rbrack \end{matrix}$

α_(i) denotes a space angle interval in which a beamforming gain of an i-th beam is maximized, θ denotes an element included in α_(i), A_(i)(θ) denotes the beamforming gain of the i-th beam, λ denotes a wavelength, d denotes an interval between transmission antennas, n denotes an index of the transmission antennas, and N denotes a number of transmission antennas.

Since physically adjacent beams are not simultaneously used in a Space Division Multiple Access (SDMA) system or the MU-MIMO system, a SIR between the adjacent beams may be regarded as ‘1’.

SIR_(i,j) may be calculated with respect to each of the vectors included in the MU-MIMO codebook generated through the operation S230 for generating the MU-MIMO codebook. Also, SIR_(min) of a minimum value from among SIR_(i,j) calculated with respect to each of sub-sets of the MU-MIMO codebook may be ascertained.

A sub-set corresponding to a maximum value of SIR_(min) calculated with respect to each of the sub-sets of the MU-MIMO codebook and having a size corresponding to the number of feedback bits may be selected as an optimized MU-MIMO codebook.

For example, in a case of the 4-bit DFT codebook, it is assumed that [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇] may be generated as the MU-MIMO codebook through the operation S230 for generating the MU-MIMO codebook. Where the number of feedback bits is limited to 3, the number of vectors included in the MU-MIMO codebook may be limited to 8 or less. Where the number of vectors included in the MU-MIMO codebook is 8, C⁸ ₁₄ numbered sub-sets may exist. In this case, SIR_(i,j) with respect to vectors included in each of the sub-sets may be calculated, and SIR_(min) with respect to each of the sub-sets may be ascertained. Also, a sub-set corresponding to a maximum value of SIR_(min) with respect to each of the sub-sets may be an optimized MU-MIMO codebook.

FIG. 5 illustrates a method for operating a base station according to an exemplary embodiment, and FIG. 6 illustrates a method for operating a terminal according to an exemplary embodiment.

Referring to FIG. 5, in operation S510, the base station stores a MU-MIMO codebook designed according to an exemplary embodiment described above.

Referring to FIG. 6, in operation S610, the terminal stores the MU-MIMO codebook like the base station.

In operation S520, the base station transmits, to a plurality of terminals, pilot signals having been well-known to the plurality of terminals.

In operation S620, the terminal estimates a channel formed between the base station and the terminal using the pilot signals. In this case, the terminal may ascertain quality and direction of the channel.

In operation S630, the terminal transmits feedback data, that is, information associated with the estimated channel to the base station. A number of bits of the feedback data may be determined in advance, and the number of feedback bits may be associated with a size of the codebook. In particular, the feedback data may include index information of a preferred vector from among a plurality of vectors included in the codebook.

In operation S530, the base station receives the feedback data from the terminal.

In operation S540, the base station receives the feedback data of each of the plurality of terminals, and selects a part or all of the plurality of terminals (users).

In operation S550, the base station selects a pre-coding matrix from among sub-sets of the codebook based on the feedback data of each of the plurality of terminals.

In operation S560, the base station performs pre-coding on at least one data stream for selected users using the selected pre-coding matrix.

In operation S640, the terminal performs reception beamforming based on a preferred vector in a case where the terminal has a plurality of reception antennas.

The methods described above may be recorded, stored, or fixed in one or more computer-readable media that includes program instructions to be implemented by a computer to cause a processor to execute or perform the program instructions. The media may also include, alone or in combination with the program instructions, data files, data structures, and the like. The media and program instructions may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer-readable media include magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD ROM disks and DVD; magneto-optical media such as optical disks; and hardware devices that are specially configured to store and perform program instructions, such as read-only memory (ROM), random access memory (RAM), flash memory, and the like. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter. The described hardware devices may be configured to act as one or more software modules in order to perform the operations and methods described above.

A number of exemplary embodiments have been described above. Nevertheless, it will be understood that various modifications may be made. For example, suitable results may be achieved if the described techniques are performed in a different order and/or if components in a described system, architecture, device, or circuit are combined in a different manner and/or replaced or supplemented by other components or their equivalents. Accordingly, other implementations are within the scope of the following claims. 

1. A Multiple User Multiple Input Multiple Output (MU-MIMO) codebook design method, the method comprising: analyzing beam patterns of candidate vectors included in a predetermined candidate codebook; and eliminating at least one of the candidate vectors based on the beam patterns of the candidate vectors to generate the MU-MIMO codebook for a MU-MIMO system being comprised of the remaining vectors.
 2. The MU-MIMO codebook design method of claim 1, further comprising: optimizing the MU-MIMO codebook based on interferences between the remaining vectors.
 3. The MU-MIMO codebook design method of claim 2, wherein the optimizing comprises selecting a part or all of the remaining vectors depending on a predetermined number of feedback bits based on the interferences between the remaining vectors.
 4. The MU-MIMO codebook design method of claim of 2, wherein the optimizing comprises calculating a signal-to-interference ratio of the remaining vectors based on the interferences generated between the remaining vectors, and selecting a part or all of the remaining vectors based on the signal-to-interference ratio of the remaining vectors.
 5. The MU-MIMO codebook design method of claim 1, wherein the eliminating comprises eliminating at least one of the candidate vectors according to a coverage of each of a plurality of sectors to generate the MU-MIMO codebook being comprised of the remaining vectors, where a cell is composed of the plurality of sectors.
 6. The MU-MIMO codebook design method of claim 1, wherein the eliminating comprises generating the MU-MIMO codebook where a cell is composed of a plurality of sectors, so as to have the remaining vectors cover a single sector.
 7. The MU-MIMO codebook design method of claim 1, wherein the eliminating comprises eliminating at least one of the candidate vectors based on a beam width of the candidate vectors to generate the MU-MIMO codebook being comprised of the remaining vectors.
 8. The MU-MIMO codebook design method of claim 1, wherein the eliminating comprises eliminating at least one of the candidate vectors in the order from a largest beam width of the candidate vectors to generate the MU-MIMO codebook being comprised of the remaining vectors.
 9. The MU-MIMO codebook design method of claim 1, wherein the predetermined candidate codebook is a codebook for a Single User Multiple Input Multiple Output (SU-MIMO) system, and the codebook for the SU-MIMO system comprises a Discrete Fourier Transformation (DFT) codebook or a codebook defined in 3^(rd) Generation Partnership Project Long Term Evolution (3GPP LTE).
 10. The MU-MIMO codebook design method of claim 1, wherein where a cell is composed of three sectors, and the predetermined candidate codebook is a codebook for a SU-MIMO system defined in 3GPP LTE, the eliminating comprises generating the MU-MIMO codebook as [u₁ u₂ u₄ u₅ u₆ u₇ u₈], wherein ${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{6} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{3\pi}{4}} & {- j} & {\left. ^{j\frac{\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{7} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{5\pi}{4}} & j & {\left. ^{{- j}\frac{\pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$
 11. The MU-MIMO codebook design method of claim 10, further comprising: selecting a part or all of vectors included in the generated [u₁ u₂ u₄ u₅ u₆ u₇ u₈] depending on a predetermined number of feedback bits to optimize the MU-MIMO codebook.
 12. The MU-MIMO codebook design method of claim 1, wherein where a cell is composed of six sectors and the predetermined candidate codebook is a codebook for a SU-MIMO system defined in 3GPP LTE, the eliminating comprises generating the MU-MIMO codebook as [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄], wherein ${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$
 13. The MU-MIMO codebook design method of claim 12, further comprising: selecting a part or all of vectors included in the generated [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄] depending on a predetermined number of feedback bits to optimize the MU-MIMO codebook.
 14. The MU-MIMO codebook design method of claim 1, wherein where a cell is composed of three sectors and the predetermined candidate codebook is a 4-bit DFT codebook, the eliminating comprises generating the MU-MIMO codebook as [u₁₄ U₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇], wherein u₁=[0.5 0.5 0.5 0.5]^(T), u ₂=[0.5 0.5j−0.5−0.5j] ^(T), u ₄=[0.5−0.5j−0.5 0.5j] ^(T), u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T), u ₆=[0.5−0.1913+0.4619j−0.3536−0.3536j 0.4619−0.1913j] ^(T), u ₇=[0.5−0.4619−0.1913j 0.3536+0.3536j−0.1913−0.4619j] ^(T), u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T), u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T), u ₁₀=[0.5−0.3536+0.3536j−0.5j 0.3536+0.353j] ^(T), u ₁₁=[0.5−0.3536−0.3536j 0.5j 0.3536−0.3536j] ^(T), u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T), u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T), u ₁₄=[0.5−0.4619+0.1913j 0.3536−0.3536j−0.1913+0.4619j] ^(T), u ₁₅=[0.5 0.1913 0.4619j 0.3536+0.3536j 0.4619+0.1913j] ^(T), and u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).
 15. The MU-MIMO codebook design method of claim 14, further comprising: selecting a part or all of vectors included in the generated [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇] depending on a predetermined number of feedback bits to optimize the MU-MIMO codebook.
 16. The MU-MIMO codebook design method of claim 1, wherein where a cell is composed of six sectors and the predetermined candidate codebook is a 4-bit DFT codebook, the eliminating comprises generating the MU-MIMO codebook as [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄], wherein u₁=[0.5 0.5 0.5 0.5]^(T), u ₂=[0.5 0.5j−0.5−0.5j] ^(T), u ₄[0.5−0.5j−0.5 0.5j] ^(T), u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T), u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T), u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T), u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T), u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T), and u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).
 17. The MU-MIMO codebook design method of claim 16, further comprising: selecting a part or all of vectors included in the generated as [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄] depending on a predetermined number of feedback bits to optimize the MU-MIMO codebook.
 18. A method for operating a base station, the method comprising: storing a part or all of vectors included in [u₁ u₂ u₄ u₅ u₆ u₇ u₈] as a MU-MIMO codebook; and pre-coding at least one data stream using the stored MU-MIMO codebook, wherein ${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{6} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{3\pi}{4}} & {- j} & {\left. ^{j\frac{\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{7} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{5\pi}{4}} & j & {\left. ^{{- j}\frac{\pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$
 19. The method of claim 18, wherein a cell of the base station comprises a plurality of sectors, and the storing comprises selecting the part or all of vectors included in the [u₁ u₂ u₄ u₅ u₆ u₇ u₈] depending on a predetermined number of feedback bits to store the part or all of vectors included in the [u₁ u₂ u₄ u₅ u₆ u₇ u₈].
 20. A method for operating a base station, the method comprising: storing a part or all of vectors included in [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄] as a MU-MIMO codebook, and pre-coding at least one data stream using the stored MU-MIMO codebook, wherein ${u_{1} = {\frac{1}{2}\begin{bmatrix} 1 & 1 & 1 & 1 \end{bmatrix}}^{T}},{u_{2} = {\frac{1}{2}\begin{bmatrix} 1 & j & {- 1} & {- j} \end{bmatrix}}^{T}},{u_{4} = {\frac{1}{2}\begin{bmatrix} 1 & {- j} & {- 1} & j \end{bmatrix}}^{T}},{u_{5} = {\frac{1}{2}\begin{bmatrix} 1 & ^{j\frac{\pi}{4}} & j & ^{j\frac{3\pi}{4}} \end{bmatrix}}^{T}},{and}$ $u_{8} = {{\frac{1}{2}\begin{bmatrix} 1 & ^{{- j}\frac{\pi}{4}} & {- j} & ^{j\frac{5\pi}{4}} \end{bmatrix}}^{T}.}$
 21. The method of claim 20, wherein a cell of the base station comprises a plurality of sectors, and the storing comprises selecting the part or all of vectors included in the [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄] depending on a predetermined number of feedback bits to store the part or all of vectors included in the [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄].
 22. A method for operating a base station, the method comprising: storing a part or all of vectors included in [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇] as a MU-MIMO codebook; and pre-coding at least one data stream using the stored MU-MIMO codebook, wherein u₁=[0.5 0.5 0.5 0.5] ^(T), u ₂=[0.5 0.5j−0.5−0.5j] ^(T), u ₄=[0.5−0.5j−0.5 0.5j] ^(T), u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T), u ₆=[0.5−0.1913+0.4619j−0.3536−0.3536j 0.4619−0.1913j] ^(T), u ₇=[0.5−0.4619−0.1913j 0.3536+0.3536j−0.1913−0.4619j] ^(T), u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T), u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T), u ₁₀=[0.5−0.3536+0.3536j−0.5j 0.3536+0.3536j] ^(T), u ₁₁=[0.5−0.3536−0.3536j 0.5j 0.3536−0.3536j] ^(T), u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T), u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T), u ₁₄=[0.5−0.4619+0.1913j 0.3536−0.3536j−0.1913+0.4619j] ^(T), u ₁₅=[0.5−0.1913−0.4619j−0.3536+0.3536j 0.4619+0.1913j] ^(T), and u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).
 23. The method of claim 22, wherein a cell of the base station comprises a plurality of sectors, and the storing comprises selecting the part or all of the vectors included in [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇] depending on a predetermined number of feedback bits to store the part or all of the vectors included in [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇].
 24. A method for operating a base station, the method comprising: storing a part or all of vectors included in [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄] as a MU-MIMO codebook; and pre-coding at least one data stream using the stored MU-MIMO codebook, wherein u₁=[0.5 0.5 0.5 0.5j] ^(T), u ₂=[0.5 0.5j−0.5−0.5j] ^(T), u ₄=[0.5−0.5j−0.5 0.5j] ^(T), u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T), u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T), u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T), u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T), u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T), and u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).
 25. The method of claim 24, wherein a cell of the base station comprises a plurality of sectors, and the storing comprises selecting a part or all of vectors included in [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄] depending on a predetermined number of feedback bits to store the part or all of the vectors included in the [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄].
 26. A method for operating a terminal, the method comprising: storing a part or all of vectors included in [u₁ u₂ u₄ u₅ u₆ u₇ u₈] as a MU-MIMO codebook; and feeding-back, to a base station, information related with at least one vector from among vectors included in the stored MU-MIMO codebook, wherein ${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{6} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{3\pi}{4}} & {- j} & {\left. ^{j\frac{\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ $u_{7} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{5\pi}{4}} & j & {\left. ^{{- j}\frac{\pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$
 27. The method of claim 26, wherein a cell of the base station comprises a plurality of sectors, and the storing comprises selecting the part or all of the vectors included in [u₁ u₂ u₄ u₅ u₆ u₇ u₈] depending on a predetermined number of feedback bits to store the part or all of the vectors included in [u₁ u₂ u₄ u₅ u₆ u₇ u₈].
 28. A method for operating a terminal, the method comprising: storing a part or all of vectors included in [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄] as a MU-MIMO codebook; and feeding-back, to a base station, information related with at least one vector from among vectors included in the stored MU-MIMO codebook, wherein ${u_{1} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & 1 & 1 & \left. 1 \right\rbrack^{T} \end{matrix}}},{u_{2} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & j & {- 1} & \left. {- j} \right\rbrack^{T} \end{matrix}}},{u_{4} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & {- j} & {- 1} & {\left. j \right\rbrack^{T},} \end{matrix}}}$ $u_{5} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{j\frac{\pi}{4}} & j & {\left. ^{j\frac{3\; \pi}{4}} \right\rbrack^{T},} \end{matrix}}$ and $u_{8} = {\frac{1}{2}\begin{matrix} \left\lbrack 1 \right. & ^{{- j}\frac{\pi}{4}} & {- j} & {\left. ^{j\frac{5\pi}{4}} \right\rbrack^{T}.} \end{matrix}}$
 29. The method of claim 28, wherein a cell of the base station comprises a plurality of sectors, and the storing comprises selecting the part or all of the vectors included in the [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄] depending on a predetermined number of feedback bits to store the part or all of the vectors included in [u₂ u₅ u₁ u₈] or [u₅ u₁ u₈ u₄].
 30. A method for operating a terminal, the method comprising: storing a part or all of vectors included in [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇] as a MU-MIMO codebook; and feeding-back, to a base station, information related with at least one vector from among vectors included in the stored MU-MIMO codebook, wherein u₁=[0.5 0.5 0.5 0.5]^(T), u ₂=[0.5 0.5j−0.5 0.5j] ^(T), u ₄=[0.5−0.5j−0.5 0.5j] ^(T), u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T), u ₇=[0.5−0.4619−0.1913j 0.3536+0.3536j−0.1913−0.4619j] ^(T), u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T), u ₉[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536j] ^(T), u ₁₀[0.5−0.3536+0.3536j−0.5j 0.3536+0.3536j] ^(T), u ₁₁=[0.5−0.3536−0.3536j 0.5j 0.3536−0.3536j] ^(T), u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T), u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T), u ₁₄=[0.5−0.4619+0.1913j 0.3536−0.3536j−0.1913+0.4619j] ^(T), u ₁₅=[0.5 0.1913−0.4619j−0.3536+0.3536j 0.4619+0.1913j] ^(T), and u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).
 31. The method of claim 30, wherein a cell of the base station comprises a plurality of sectors, and the storing comprises selecting the part or all of the vectors included in [u₁₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁] or [u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₁₅ u₁₁ u₇] depending on a predetermined number of feedback bits to store the part or all of the vectors included in [u₄ u₁₀ u₆ u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄ u₁₅ u₁₁ u₇].
 32. A method for operating a terminal, the method comprising: storing a part or all of vectors included in [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄] as a MI-MIMO codebook; and feeding-back, to a base station, information related with at least one vector from among vectors included in the stored MU-MIMO codebook, wherein u₁=[0.5 0.5 0.5]^(T), u ₂=[0.5 0.5j−0. 5 0.5j] ^(T), u ₄=[0.5−0.5j−0.5 0.5j] ^(T), u ₅=[0.5 0.4619+0.1913j 0.3536+0.3536j 0.1913+0.4619j] ^(T), u ₈=[0.5 0.1913−0.4619j−0.3536−0.3536j−0.4619+0.1913j] ^(T), u ₉=[0.5 0.3536+0.3536j 0.5j−0.3536+0.3536] ^(T), u ₁₂=[0.5 0.3536−0.3536j−0.5j−0.3536−0.3536j] ^(T), u ₁₃=[0.5 0.1913+0.4619j−0.3536+0.3536j−0.4619−0.1913j] ^(T), u ₁₆=[0.5 0.4619−0.1913j 0.3536−0.3536j 0.1913−0.4619j] ^(T).
 33. The method of claim 32, wherein a cell of the base station comprises a plurality of sectors, and the storing comprises selecting the part or all of the vectors included in the [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄] depending on a predetermined number of feedback bits to store the part or all of the vectors included in the [u₂ u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈] or [u₁₃ u₉ u₅ u₁ u₁₆ u₁₂ u₈ u₄].
 34. A computer-readable storage medium storing a program to design a Multiple User Multiple Input Multiple Output (MU-MIMO) codebook, comprising instructions to cause a computer to: analyze beam patterns of candidate vectors included in a predetermined candidate codebook; and eliminate at least one of the candidate vectors based on the beam patterns of the candidate vectors to generate the MU-MIMO codebook for a MU-MIMO system being comprised of the remaining vectors. 